Browsing by Subject "Parallel Algorithms"

Now showing items 1-5 of 5

    • A Framework For Parallelizing Sampling-Based Motion Planning Algorithms 
      Bulluck, Matthew James (2017-12-08)
      Motion planning is the problem of finding a valid path for a robot from a start position to a goal position. It has many uses such as protein folding and animation. However, motion planning can be slow and take a long time ...
    • Hardware Architecture for Semantic Comparison 
      Mohan, Suneil (2012-07-16)
      Semantic Routed Networks provide a superior infrastructure for complex search engines. In a Semantic Routed Network (SRN), the routers are the critical component and they perform semantic comparison as their key computation. ...
    • Parallel algorithms for inductance extraction 
      Mahawar, Hemant (Texas A&M University, 2007-09-17)
      In VLSI circuits, signal delays play an important role in design, timing verification and signal integrity checks. These delays are attributed to the presence of parasitic resistance, capacitance and inductance. With ...
    • Parallel Simulation for VLSI Power Grid 
      Zhang, Le (2015-07-23)
      Due to the increasing complexity of VLSI circuits, power grid simulation has become more and more time-consuming. Hence, there is a need for fast and accurate power grid simulator. In order to perform power grid simulation ...
    • A Scalable Framework for Parallelizing Sampling-Based Motion Planning Algorithms 
      Jacobs, Samson Ade (2014-04-29)
      Motion planning is defined as the problem of finding a valid path taking a robot (or any movable object) from a given start configuration to a goal configuration in an environment. While motion planning has its roots in ...